Description: 分支定界法可以求解小规模的TSP问题,这个例子是用vc编写的-branch and bound method can solve small-scale TSP, this example was prepared by the vc Platform: |
Size: 9840 |
Author:yy |
Hits:
Description: 货郎担分枝限界图形演示
问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 4253 |
Author:林周 |
Hits:
Description: 采用分枝限界法解决0/1背包问题!
本人上机实习作业,通过老师验收,合格!
针对部分上机实习的同学可以来下~-used Branch and Bound France 0 / 1 knapsack problem! I practice on the machine operations, acceptance by the teachers, qualified! In view of the attachment on the machine for students to the next ~ Platform: |
Size: 1825 |
Author:张锐 |
Hits:
Description: 分支限界法解圆排列问题，是一个算法设计与分析课程的作业-branch and bound method for solving problems with a round of one algorithm design and analysis of the operational programs Platform: |
Size: 49592 |
Author:老七 |
Hits:
Description: 优先队列式分支限界法园排列问题，是一个作业，算法设计与分析-priority queue-branch and bound with France Park, is an operation, algorithm design and analysis Platform: |
Size: 17167 |
Author:老七 |
Hits:
Description: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C + + 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use. Platform: |
Size: 31029 |
Author:buaa_sheng |
Hits:
Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 -the book is on the computer science and engineering fields, the basis for one of the subjects of study -- data structure and algorithm expertise with. The book in a brief review of the basic design concept C program on the basis of a comprehensive and systematic introduction of the queue, stack, trees and Figure basic data structure and the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm multiple algorithm design method data structures and algorithms for continuous learning and research have laid a solid foundation. Even more valuable is that the book not only of theoretical knowledge, also provided more than 50 application examples and more than 600 Exercises Road. The contents broad authority, a clear and reasonable structure, a new data structure and algorithm Platform: |
Size: 11776064 |
Author:猫扑 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853791 |
Author:陈宝文 |
Hits:
Description: 背包问题优先队列分枝限界算法
所谓的背包问题，可以描述如下：一个小偷打劫一个保险箱，发现柜子里有N类不同大小与价值的物品，但小偷只有一个容积为M的背包来装东西，背包问题就是要找出一个小偷选择所偷物品的组合，以使偷走的物品总价值最大。这个问题的求解有很多种方法，本程序使用分枝限界法求解。-knapsack problem Branch and Bound priority queue algorithm called knapsack problem can be described as follows : a thief robbed a safe, found N closets, a different type size and value of the items, but the thieves only one volume of M backpack to hold things. knapsack problem is to identify a thief stole items chosen by the portfolio, so that stolen goods worth largest. Solving this problem is many ways, the procedures used Branch and Bound method. Platform: |
Size: 238592 |
Author:王涛 |
Hits:
Description: 这是一个用分支限界法实线01背包问题的说明文档，包含代码-This is a branch and bound method with solid line 01 knapsack problem of documentation, including code Platform: |
Size: 22528 |
Author:lius |
Hits:
Description: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem Platform: |
Size: 1052672 |
Author:hehuiling |
Hits:
Description: This file contains my project from Algorithm class on Traveling Salesman Problem. It implements some branch and bound methods to increase it s performance. In the main function you can find that I use Drzewo() function Drzewoopt() functins stand for optimal search using sorted city tabel. Each Drzewo() function represents diffrent way to cut off non optimal solutions with increasing effectivity Platform: |
Size: 4345856 |
Author:Antoni |
Hits:
Description: 研究生上课所用的算法分析与设计相关文档PPT，分八个章节对算法进行详细介绍：
第1章 算法引论
第2章 递归与分治策略
第3章 动态规划
第4章 贪心算法
第5章 回溯法
第6章 分支限界法
第7章 概率算法
第8章 NP完全性理论
-Graduate classes used in algorithm analysis and design documents the PPT is divided into eight chapters on the algorithm described in detail: Chapter 1 algorithm Introduction Chapter 2 recursive divide and conquer strategy in Chapter 3 of Chapter 4 of the dynamic programming greedy algorithm back in Chapter 5 Chapter 6 France branch and bound method in Chapter 7 of probabilistic algorithms in Chapter 8 of the NP-complete theory Platform: |
Size: 2043904 |
Author:独角之灵 |
Hits:
Description: 关于基因序列上的比对问题 运用的方法是分支定界法 同时有贪婪算法作以比较-On the sequence alignment problem on the use of branch and bound method is a greedy algorithm for the same time to compare Platform: |
Size: 5120 |
Author:王明理 |
Hits:
Description: 外观模拟分支定界 分支定界 分支定界,可以很好-Branch and bound appearance simulation branch and bound branch and bound, branch and bound can be very good Platform: |
Size: 107520 |
Author:Kenneqy |
Hits:
Description: Branch and bound appearance simulation branch and bound branch and bound, branch and bound can be very good Platform: |
Size: 106496 |
Author:torakknu
|
Hits:
Search - branch and bound